Semi-Proximal Augmented Lagrangian-Based Decomposition Methods for Primal Block-Angular Convex Composite Quadratic Conic Programming Problems
نویسندگان
چکیده
منابع مشابه
A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
This paper is devoted to the design of an efficient and convergent semiproximal alternating direction method of multipliers (ADMM) for finding a solution of low to medium accuracy to convex quadratic conic programming and related problems. For this class of problems, the convergent two block semi-proximal ADMM can be employed to solve their primal form in a straightforward way. However, it is k...
متن کاملAn Augmented Lagrangian Method for Conic Convex Programming
We propose a new first-order augmented Lagrangian algorithm ALCC for solving convex conic programs of the form min { ρ(x) + γ(x) : Ax− b ∈ K, x ∈ χ } , where ρ : Rn → R ∪ {+∞}, γ : Rn → R are closed, convex functions, and γ has a Lipschitz continuous gradient, A ∈ Rm×n, K ⊂ Rm is a closed convex cone, and χ ⊂ dom(ρ) is a “simple” convex compact set such that optimization problems of the form mi...
متن کاملAugmented Lagrangian Methods and Proximal Point Methods for Convex Optimization
We present a review of the classical proximal point method for nding zeroes of maximal monotone operators, and its application to augmented Lagrangian methods, including a rather complete convergence analysis. Next we discuss the generalized proximal point methods, either with Bregman distances or -divergences, which in turn give raise to a family of generalized augmented Lagrangians, as smooth...
متن کاملIteration-complexity of first-order augmented Lagrangian methods for convex conic programming
In this paper we consider a class of convex conic programming. In particular, we propose an inexact augmented Lagrangian (I-AL) method for solving this problem, in which the augmented Lagrangian subproblems are solved approximately by a variant of Nesterov’s optimal first-order method. We show that the total number of first-order iterations of the proposed I-AL method for computing an ǫ-KKT sol...
متن کاملPrimal and dual active-set methods for convex quadratic programming
Computational methods are proposed for solving a convex quadratic program (QP). Active-set methods are defined for a particular primal and dual formulation of a QP with general equality constraints and simple lower bounds on the variables. In the first part of the paper, two methods are proposed, one primal and one dual. These methods generate a sequence of iterates that are feasible with respe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Optimization
سال: 2021
ISSN: 2575-1484,2575-1492
DOI: 10.1287/ijoo.2019.0048